Expanding the Swiss autosomal marker set to 32 STRs
نویسندگان
چکیده
منابع مشابه
Autosomal STRs Provide Genetic Evidence for the Hypothesis That Tai People Originate from Southern China
Tai people are widely distributed in Thailand, Laos and southwestern China and are a large population of Southeast Asia. Although most anthropologists and historians agree that modern Tai people are from southwestern China and northern Thailand, the place from which they historically migrated remains controversial. Three popular hypotheses have been proposed: northern origin hypothesis, souther...
متن کاملExpanding the choice set : Supercharging active
Recent work has suggested that yes/no response formats, or active choice, can increase enrollment compared to opt-in procedures. To encourage even greater enrollment and increased participant engagement in academic research studies, we investigated the impact on participation rates of presenting multiple “yes” or “no” options. We demonstrate that the provision of additional, more labor-intensiv...
متن کاملGenetic ancestry of a Moroccan population as inferred from autosomal STRs
Detecting population substructure and ancestry is a critical issue for both association studies of health behaviors and forensic genetics. Determining aspects of a population's genetic history as potential sources of substructure can aid in design of future genetic studies. Within this context, fifteen autosomal short tandem repeat (STR), were used to examine population genetic structure and hy...
متن کاملA New Multiplex Assay of 17 Autosomal STRs and Amelogenin for Forensic Application
This paper describes a newly devised autosomal short tandem repeat (STR) multiplex polymerase chain reaction (PCR) systems for 17 autosomal loci (D1S1656, D2S441, D3S1358, D3S3045, D6S477, D7S3048, D8S1132, D10S1435, D10S1248, D11S2368, D13S325, D14S608, D15S659, D17S1290, D18S535, D19S253 and D22-GATA198B05) and Amelogenin. Primers for the loci were designed and optimized so that all of the am...
متن کاملAn Iterated Heuristic Algorithm for the Set Covering Problem 32
The set covering problem is a well-known NP-hard combinatorial optimization problem with wide practical applications. This paper introduces a novel heuristic for the uni-cost set covering problem. An iterated approximation algorithm (ITEG) based on this heuristic is developed: in the rst iteration a cover is constructed, and in the next iterations a new cover is built by starting with part of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Legal Medicine
سال: 2021
ISSN: 0937-9827,1437-1596
DOI: 10.1007/s00414-021-02624-w